Convergence of the Population Dynamics algorithm in the Wasserstein metric

نویسنده

  • Mariana Olvera-Cravioto
چکیده

We study the convergence of the population dynamics algorithm, which produces sample pools of random variables having a distribution that closely approximates that of the special endogenous solution to a stochastic fixed-point equation of the form: R D = Φ(Q,N, {Ci}, {Ri}), where (Q,N, {Ci}) is a real-valued random vector with N ∈ N, and {Ri}i∈N is a sequence of i.i.d. copies of R, independent of (Q,N, {Ci}); the symbol D = denotes equality in distribution. Specifically, we show its convergence in the Wasserstein metric of order p (p ≥ 1) and prove the consistency of estimators based on the sample pool produced by the algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

W-convergence of the proximal point algorithm in complete CAT(0) metric spaces

‎In this paper‎, ‎we generalize the proximal point algorithm to complete CAT(0) spaces and show‎ ‎that the sequence generated by the proximal point algorithm‎ $w$-converges to a zero of the maximal‎ ‎monotone operator‎. ‎Also‎, ‎we prove that if $f‎: ‎Xrightarrow‎ ‎]-infty‎, +‎infty]$ is a proper‎, ‎convex and lower semicontinuous‎ ‎function on the complete CAT(0) space $X$‎, ‎then the proximal...

متن کامل

Convergence in the Wasserstein Metric for MarkovChain

This paper gives precise bounds on the convergence time of the Gibbs sampler used in the Bayesian restoration of a degraded image. Convergence to stationarity is assessed using the Wasserstein metric, rather than the usual choice of total variation distance. The Wasserstein metric may be more easily applied in some applications, particularly those on continuous state spaces. Bounds on convergen...

متن کامل

On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.

متن کامل

.convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration

In this paper, we show how the time for convergence to stationarity of a Markov chain can be assessed using the Wasser-stein metric, rather than the usual choice of total variation distance. The Wasserstein metric may be more easily applied in some applications, particularly those on continuous state spaces. Bounds on convergence time are established by considering the number of iterations requ...

متن کامل

Airfoil Shape Optimization with Adaptive Mutation Genetic Algorithm

An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017